Sampling at subexponential times, with queueing applications

Cyclic Queueing Networks with Subexponential Service Times

For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.

Tail Asymptotics of Queueing Networks with Subexponential Service Times

To myself and my parents... iii ACKNOWLEDGEMENTS Throughout my graduate studies, I am indebted to many people for their help and encouragement. First of all, I would like to thank my advisor Prof. Hayriye Ayhan. It is impossible for me to express in words my full appreciation. However, I would like to thank all of her advice and support during my graduate studies. I would not have completed thi...

Subexponential Asymptotics of a Markov-Modulated Random Walk with Queueing Applications

and approximations for atm multiplexers with applications to video teleconferencing," \Logarithmic asymptotics for steady-state tail probabilities in a single-server queue," Studies in Appl. KAR30] J. Karamata, \Sur un mode de croissance r eguili ere des fonctions," Mathematica (Cluj), 1930. ARN80] K. Arndt, \Asymptotic properties of the distributions of the supremum of random walk on a markov ...

Telecommunication Traffic, Queueing Models, and Subexponential Distributions

Queueing Theory with Applications

Much that is essential in modern life would not be possible without queueing theory. All communication systems depend on the theory including the Internet. In fact, the theory was developed at the time that telephone systems were growing and requiring more and more sophistication to manage their complexity. Much of the theory was developed by Agner Krarup Erlang (1878-1929). He worked for Copen...